Inductive Learning from Good Examples

نویسنده

  • Charles X. Ling
چکیده

We study what kind of data may ease the computational complexity of learning of Horn clause theories (in Gold's paradigm) and Boolean functions (in PAC-learning paradigm). We give several deenitions of good data (basic and generative representative sets), and develop data-driven algorithms that learn faster from good examples, and degenerate to learn in the limit from the \worst" possible examples. We show that Horn clause theories, k-term DNF and general DNF Boolean functions are polynomially learnable from generative representative presentations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limitations on Inductive Learning

This paper explores the proposition that inductive learning from examples is fundamentally limited to learning only a small fraction of the total space of possible hypotheses. We begin by deening the notion of an algorithm reliably learning a good approximation to a concept C. An empirical study of three algorithms (the classical algorithm for maximally speciic conjunctive generalizations, ID3,...

متن کامل

Active Teaching for Inductive Learners

We propose and study a new intelligent teaching paradigm called active teaching in this paper. In contrast to active learning, we assume that the learner can only passively conduct inductive learning from the given examples, but the teacher (oracle) can actively provide “good” examples to the learner, in order to speed up the teaching (learning) process. We establish the framework with four spe...

متن کامل

Diagara: an Incremental Algorithm for Inferring Implicative Rules from Examples

An approach is proposed for inferring implicative logical rules from examples. The concept of a good diagnostic test for a given set of positive examples lies in the basis of this approach. The process of inferring good diagnostic tests is considered as a process of inductive common sense reasoning. The incremental approach to learning algorithms is implemented in an algorithm DIAGaRa for infer...

متن کامل

Technique for Selecting Examples in Inductive Learning

The data set used can influence the way in which inductive learning algorithms generate rules. A good set of training examples is a very important factor in obtaining high training and test accuracies but algorithm execution time can be greatly affected by the input data. The use of specific examples decreases the time incurred when updating concept descriptions and allows for the representatio...

متن کامل

Some Active Learning Schemes to Acquire Control Knowledge for Planning

Active learning consists on the incremental generation of “good” training examples for machine learning techniques. Usually, the objective is to balance between cost of generating and analyzing all the instance space, and cost of generation of “good” examples. While there has been some work on its application to inductive learning techniques, there have been very few approaches applying it to p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991